The Markov chain asymptotics of random mapping graphs
نویسندگان
چکیده
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولAsymptotics of Markov Kernels and the Tail Chain
An asymptotic model for extreme behavior of certain Markov chains is the ``tail chain''. Generally taking the form of a multiplicative random walk, it is useful in deriving extremal characteristics such as point process limits. We place this model in a more general context, formulated in terms of extreme value theory for transition kernels, and extend it by formalizing the distinction between e...
متن کاملA study of the edge-switching Markov-chain method for the generation of random graphs
We study the problem of generating connected random graphs with no self-loops or multiple edges and that, in addition, have a given degree sequence. The generation method we focus on is the edge-switching Markov-chain method, whose functioning depends on a parameter w related to the method’s core operation of an edge switch. We analyze two existing heuristics for adjusting w during the generati...
متن کاملOn the asymptotics of constrained exponential random graphs
The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but in many situations partial information of the graph is already known beforehand. A natural question to ask is what would be a typical random graph drawn from an exponential model subject to certain constraints? In particular, will there be a similar phase transition phenomenon as t...
متن کاملThe Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, algorithms, engineering and evolution. To date, all available data for such networks suggest heavy tailed statistics, most notably on the degrees of the underlying graphs. A practical way to generate network topologies t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincare (B) Probability and Statistics
سال: 2007
ISSN: 0246-0203
DOI: 10.1016/j.anihpb.2006.05.004